P versus NP problem - PDFSEARCH.IO - Document Search Engine

P versus NP problem
Results: 202

#	Item
71	Towards overcoming the knowledge acquisition bottleneck in Answer Set Prolog applications: embracing natural language inputs Chitta Baral, Juraj Dzifcak and Luis Tari School of Computing and Informatics Arizona State Uni Add to Reading List Source URL: www.public.asu.edu Language: English - Date: 2008-03-02 20:59:01 NP Syntax P Categorial grammar P versus NP problem Combinatory categorial grammar Theoretical computer science Complexity classes Applied mathematics
72	NURSE PRACTITIONER COLLABORATIVE MEETING Add to Reading List Source URL: cpn.unimelb.edu.au Language: English - Date: 2010-06-22 00:31:26 Complexity classes Mathematical optimization Nurse practitioner P versus NP problem NP Formulary Agenda Theoretical computer science Mysteries Applied mathematics
73	Mathematical Problems for the Next Century1 Steve Smale Department of Mathematics City University of Hong Kong Kowloon, Hong Kong August 7, 1998 Add to Reading List Source URL: www6.cityu.edu.hk Language: English - Date: 2012-09-11 23:37:15 Conjectures Millennium Prize Problems Mathematical optimization Complexity classes Diophantine equation Riemann hypothesis Stephen Smale Time complexity P versus NP problem Theoretical computer science Mathematics Computational complexity theory
74	Undecidability and Intractability in Theoretical PhysicsPhysical processes are viewed as computations, and the difficulty of answering Add to Reading List Source URL: www.stephenwolfram.com Language: English - Date: 2013-09-24 11:02:15 Computability theory Theory of computation Structural complexity theory Computational problems Cellular automaton Computational irreducibility A New Kind of Science Turing machine P versus NP problem Theoretical computer science Applied mathematics Mathematics
75	CS 330 – Spring 2013, Assignment 6 Problems due in the drop-box by 5PM, Thursday, April 18th (Monday schedule that day) Late assignments will only be accepted up until 5PM on Friday, April 19th Question[removed]pts). Cha Add to Reading List Source URL: www.cs.bu.edu Language: English - Date: 2013-04-05 16:53:19 Applied mathematics NP-complete NP P P versus NP problem NP-hard Theoretical computer science Computational complexity theory Complexity classes
76	The Complexity of Reasoning with Global Constraints Christian Bessiere LIRMM, CNRS/U. Montpellier Montpellier, France [removed] Add to Reading List Source URL: www.cse.unsw.edu.au Language: English - Date: 2006-09-13 04:55:34 Applied mathematics Local consistency Constraint satisfaction problem Constraint satisfaction NP-complete Computational complexity theory NP P versus NP problem Complexity of constraint satisfaction Theoretical computer science Constraint programming Complexity classes
77	Annals of Mathematics, [removed]), 439–485 On the hardness of approximating minimum vertex cover By Irit Dinur and Samuel Safra* Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2006-04-11 06:21:40 NP-complete problems Vertex cover Independent set NP-complete NP PCP theorem Maximal independent set Power set P versus NP problem Theoretical computer science Mathematics Computational complexity theory
78	09421 Abstracts Collection Algebraic Methods in Computational Complexity Dagstuhl Seminar 1 Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2010-01-20 05:14:19 Lance Fortnow Bounded-error probabilistic polynomial P versus NP problem Low NP-complete Reduction IP Probabilistically checkable proof NP Theoretical computer science Applied mathematics Computational complexity theory
79	Simulatable Commitments and Efficient Concurrent Zero-Knowledge Daniele Micciancio1 ? Add to Reading List Source URL: www.iacr.org Language: English - Date: 2008-09-15 00:54:52 Applied mathematics Interactive proof system Zero-knowledge proof IP NP Commitment scheme Soundness Alice and Bob P versus NP problem Theoretical computer science Cryptography Cryptographic protocols
80	Georgia Perimeter College Common Course Outline Course Abbreviation & Number: Math 2420 Add to Reading List Source URL: www.gpc.edu Language: English - Date: 2012-02-09 09:25:38 Graph Discrete mathematics Combinatorics Binary relation Emmy Noether Model theory Conjectures P versus NP problem Computational complexity theory Mathematics Graph theory Function

UPDATE